Solving Satisfiability Problem by Computing Stable Sets of Points in Clusters

نویسنده

  • Eugene Goldberg
چکیده

Earlier we introduced the notion of a stable set of points (SSP) and showed that a CNF formula is unsatisfiable iff there is a set of points (i.e. complete assignments) that is stable. Experiments showed that SSPs of CNF formulas of practical interest are very big. So computing an SSP of a CNF formula point by point is, in general, infeasible. In this report, we show how an SSP can be computed in “clusters”, each cluster being a large set of points that are processed “simultaneously”.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)

It’s known that 3-satisfiability problem is NP-complete. Here polynomial algorithm for solving k-satisfiability (k ≥ 2) problem is assumed. In case theoretical points are right, sets P ans NP are equal.

متن کامل

Conflict-driven answer set solving: From theory to practice

We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply ad...

متن کامل

A bi-level linear programming problem for computing the nadir point in MOLP

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

متن کامل

Classical Methods in Nonmonotonic Reasoning

In this paper we present and compare some classical problem solving methods for computing the stable models of logic programs with negation. In particular linear programming, propositional satisfiability, constraint satisfaction, and graph algorithrns are consi<lered. Central to our approach is the representation of the logic program by means of a graph.

متن کامل

Solving “Hard” Satisfiability Problems Using GridSAT

We present the latest instantiation of GridSAT [5], a distributed and complete satisfiability solver that is explicitly designed to aggregate grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005